Improved Streaming Algorithms for Weighted Matching, via Unweighted Matching
نویسندگان
چکیده
We present a (4 + ) approximation algorithm for weighted graph matching which applies in the semistreaming, sliding window, and MapReduce models; this single algorithm improves the previous best algorithm in each model. The algorithm operates by reducing the maximum-weight matching problem to a polylog number of copies of the maximum-cardinality matching problem. The algorithm also extends to provide approximation guarantees for the more general problem of finding weighted independent sets in p-systems (which include intersections of p matroids and p-bounded hypergraph matching). 1998 ACM Subject Classification F.1.1 [Computation by Abstract Devices]: Models of Computation – relations between models, F.1.2 [Computation by Abstract Devices]: Modes of Computation – online computation, G.2.2 [Discrete Mathematics]: Graph Theory – graph algorithms, hypergraphs
منابع مشابه
Structural Results on Matching Estimation with Applications to Streaming∗
2. We further show that the weight of a maximum weighted matching can be efficiently estimated by augmenting any routine for estimating the size of an unweighted matching. Namely, given an algorithm for computing a λ-approximation in the unweighted case, we obtain a 2(1 + ε) · λ approximation for the weighted case, while only incurring a multiplicative logarithmic factor in the space bounds. Th...
متن کاملImproved Deterministic Algorithms for Weighted Matching and Packing Problems
Based on the method of (n, k)-universal sets, we present a deterministic parameterized algorithm for the weighted rd-matching problem with time complexity O∗(4(r−1)k+o(k)), improving the previous best upper bound O∗(4rk+o(k)). In particular, the algorithm applied to the unweighted 3d-matching problem results in a deterministic algorithm with time O ∗(16k+o(k)), improving the previous best resul...
متن کاملEfficient Distributed Weighted Matchings on Trees
In this paper, we study distributed algorithms to compute a weighted matching that have constant (or at least sub-logarithmic) running time and that achieve approximation ratio 2 + ǫ or better. In fact we present two such synchronous algorithms, that work on arbitrary weighted trees. The first algorithm is a randomised distributed algorithm that computes a weighted matching of an arbitrary weig...
متن کاملDeterministic Parameterized Algorithms for Matching and Packing Problems
We present three deterministic parameterized algorithms for well-studied packing and matching problems, namely, Weighted q-Dimensional p-Matching ((q, p)-WDM) and Weighted qSet p-Packing ((q, p)-WSP). More specifically, we present an O(2.85043) time deterministic algorithm for (q, p)-WDM, an O(8.04143) time deterministic algorithm for the unweighted version of (3, p)-WDM, and an O((0.56201 · 2....
متن کاملOptimizing Disparity Candidates Space in Dense Stereo Matching
In this paper, a new approach for optimizing disparity candidates space is proposed for the solution of dense stereo matching problem. The main objectives of this approachare the reduction of average number of disparity candidates per pixel with low computational cost and high assurance of retaining the correct answer. These can be realized due to the effective use of multiple radial windows, i...
متن کامل